High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer
نویسندگان
چکیده
We present a unified view of the two-party and multi-party computation protocols based on oblivious transfer first outlined in Nielsen et al. (CRYPTO 2012) Larraia 2014). number modifications improvements to these earlier presentations, as well full proofs entire protocol. Improvements include pre-processing online MAC methodology, mechanisms pass between different variants fixing minor bug protocol relation selective failure attack. It also fixes resulting from using Jensen’s inequality wrong direction an analysis.
منابع مشابه
High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer
We present a unified view of the two-party and multi-party computation protocols based on oblivious transfer first outlined in Nielsen et al and Larraia et al. We present a number of modifications and improvements to these earlier presentations, as well as full proofs of the entire protocol. Improvements include a unified pre-processing and online MAC methodology, mechanisms to pass between dif...
متن کاملDishonest Majority Multi-Party Computation for Binary Circuits
We extend the Tiny-OT two party protocol of Nielsen et al (CRYPTO 2012) to the case of n parties in the dishonest majority setting. This is done by presenting a novel way of transferring pairwise authentications into global authentications. As a by product we obtain a more efficient manner of producing globally authenticated shares, in the random oracle model, which in turn leads to a more effi...
متن کاملCommitted Oblivious Transfer and Private Multi-Party Computation
In this paper we present an eecient protocol for \Commit-ted Oblivious Transfer" to perform oblivious transfer on committed bits: suppose Alice is committed to bits a0 and a1 and Bob is committed to b, they both want Bob to learn and commit to a b without Alice learning b nor Bob learning a b. Our protocol, based on the properties of error correcting codes, uses Bit Commitment (bc) and one-out-...
متن کاملA Synchronous Model for Multi-Party Computation and the Incompleteness of Oblivious Transfer
This work develops a composable notion of security in a synchronous communication network to analyze cryptographic primitives and protocols in a reliable network with guaranteed delivery. In such a synchronous model the abort of protocols must be handled explicitly. It is shown that a version of global bit commitment which allows to identify parties that did not give proper input cannot be secu...
متن کاملSecure Two-Party Computation via Leaky Generalized Oblivious Transfer
We construct a very efficient protocol for constant round Two-Party Secure Function Evaluation based on general assumptions. We define and instantiate a leaky variant of Generalized Oblivious Transfer based on Oblivious Transfer and Commitment Schemes. The concepts of Garbling Schemes, Leaky Generalized Oblivious Transfer and Privacy Amplification are combined using the Cut-and-Choose paradigm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2021
ISSN: ['0933-2790', '1432-1378']
DOI: https://doi.org/10.1007/s00145-021-09403-1